home *** CD-ROM | disk | FTP | other *** search
- Path: csd.uwo.ca!jamie
- From: jamie@csd.uwo.ca (J. Blustein)
- Newsgroups: comp.lang.c
- Subject: Re: unique id for a string
- Date: 23 Feb 1996 20:55:27 GMT
- Organization: Computer Science Dept., Univ. of Western Ontario, London, Canada
- Message-ID: <4gl9jv$9f2@falcon.ccs.uwo.ca>
- References: <1996Feb16.175601.114182@kuhub.cc.ukans.edu> <3129dd39.961626@news.iquest.net> <4gfpveINNe68@keats.ugrad.cs.ubc.ca> <4gih8a$b62@madeline.ins.cwru.edu>
- Reply-To: jamie@uwo.ca
- NNTP-Posting-Host: mccarthy.csd.uwo.ca
- Summary: Referecne of TCJ article about fast find for min. perfect hash functions
- Keywords: hash minimal perfect finding reference journal
- X-Copyright: copyright (c) J. Blustein, 1996. All rights reserved
- Disclaimer: It's people like you what cause unrest!
-
- In article <4gih8a$b62@madeline.ins.cwru.edu>,
- >Actually, it's not *that* difficult to find. Try running gperf from GNU
- >or reading the paper cited in my previous post in this subject. The
- >results in the paper claim to be able to find a perfect hash function
- >for 262,144 18-character words in 16.087 seconds on a Sun Sparc 2.
- >Doesn't sound that difficult to me. :)
-
- I was looking through back issues of TCJ just yesterday and so I happen
- to have this reference beside me. I haven't read the article but I think
- it will help:
-
- A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
- Zbigniew J. Czech and Bohdan S. Majewski
- The Computer Journal 36(6), 1993
- I don't know the page numbers.
-
- If you want something that is already implemented (a different sort of
- time complexity) then gperf might be just the ticket. I think it's neat
- myself.
- --
- Jamie Blustein `Did you say "knives"?'
- <jamie@uwo.ca> `*Rotating* knives, yes.'
-